Generalized identification experiments for finite deterministic automata
نویسندگان
چکیده
منابع مشابه
Deterministic Generalized Automata
A generalized automaton (GA) is a nite automaton where the single transitions are deened on words rather than on single letters. Generalized automata were considered by K. Hashiguchi who proved that the problem of calculating the size of a minimal GA is decidable. We deene the model of deterministic generalized automaton (DGA) and study the problem of its minimization. A DGA has the restriction...
متن کاملFailure Deterministic Finite Automata
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for deriving from a given deterministic finite automaton (DFA) a language-equivalent FDFA. The FDFA’s transition diagram has fewer arcs than that of the...
متن کاملNon-Deterministic Finite Cover Automata
The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages. In some cases representing a finite language using a Non-deterministic Finite Automata (NFA) may significantly reduce the number of required states. The combined power of the succinctness of the representation of fin...
متن کاملSynchronizing non-deterministic finite automata
In this paper, we show that every D3-directing CNFA can be mapped uniquely to a DFA with the same synchronizing word length. This implies that Černý’s conjecture generalizes to CNFAs and that the general upper bound for the length of a shortest D3-directing word is equal to the Pin-Frankl bound for DFAs. As a second consequence, for several classes of CNFAs sharper bounds are established. Final...
متن کاملCycle Analysis for Deterministic Finite State Automata
A method for the determination of all cycles of deterministic finite state automata is presented. Using a finite field description GF(2) these automata are shown to correspond to multilinear state equations. Basic results from feedback shift register theory are recalled and developed towards a complete analysis tool for affine-linear automata. The multilinear case is reduced to the affine-linea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1982
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-7-1-45-51